Covering Pareto Sets by Multilevel Subdivision Techniques
نویسندگان
چکیده
In this work we present a new set oriented numerical method for the numerical solution of multi-objective optimization problems. These methods are global in nature and allow to approximate the entire set of (global) Pareto points. After proving convergence of an associated abstract subdivision procedure we use this result as a basis for the development of three different algorithms. We also consider appropriate combinations of them in order to increase the total performance. Finally we illustrate the efficiency of these techniques both by several academic examples and by one concrete technical application, namely the optimization of an active suspension system for cars.
منابع مشابه
Almost Invariant Sets in Chua's Circuit
Recently multilevel subdivision techniques have been introduced in the numerical investigation of complicated dynamical behavior. We illustrate the applicability and efficiency of these methods by a detailed numerical study of Chua’s circuit. In particular we will show that there exist two regions in phase space which are almost invariant in the sense that typical trajectories stay inside each ...
متن کاملSingle Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...
متن کاملA jointly constrained bilinear programming method for solving generalized Cournot-Pareto models
We propose a vector optimization approach to linear Cournot oligopolistic market equilibrium models where the strategy sets depend on each other. We use scalarization technique to find a Pareto efficient solution to the model by using a jointly constrained bilinear programming formulation. We then propose a decomposition branch-and-bound algorithm for globally solving the resulting bilinear pro...
متن کاملGlobal Optimization using a Dynamical Systems Approach
We develop new algorithms for global optimization by combining well known branch and bound methods with multilevel subdivision techniques for the computation of invariant sets of dynamical systems. The basic idea is to view iteration schemes for local optimization problems — e.g. Newton’s method or conjugate gradient methods — as dynamical systems and to compute set coverings of their fixed poi...
متن کاملReduced Complexity Rule Induction
We present an architecture for rule induction that emphasizes compact, reduced-complexity rules. A new heuristic technique for finding a covering rule set of sample data is described. This technique refines a set of production rules by iteratively replacing a component of a rule with its single best replacement. A method for rule induction has been developed that combines this covering and refi...
متن کامل